bogo-sort - definition. What is bogo-sort
Diclib.com
قاموس ChatGPT
أدخل كلمة أو عبارة بأي لغة 👆
اللغة:

ترجمة وتحليل الكلمات عن طريق الذكاء الاصطناعي ChatGPT

في هذه الصفحة يمكنك الحصول على تحليل مفصل لكلمة أو عبارة باستخدام أفضل تقنيات الذكاء الاصطناعي المتوفرة اليوم:

  • كيف يتم استخدام الكلمة في اللغة
  • تردد الكلمة
  • ما إذا كانت الكلمة تستخدم في كثير من الأحيان في اللغة المنطوقة أو المكتوبة
  • خيارات الترجمة إلى الروسية أو الإسبانية، على التوالي
  • أمثلة على استخدام الكلمة (عدة عبارات مع الترجمة)
  • أصل الكلمة

%ما هو (من)٪ 1 - تعريف

HIGHLY INEFFECTIVE SORTING ALGORITHM THAT SUCCESSIVELY GENERATES PERMUTATIONS OF ITS INPUT UNTIL IT FINDS ONE THAT IS SORTED
Stupid sort/Bogo-sort; Stupid sort/Bogosort; Bozo sort; Randomsort; Random sort; Bogo-sort; Monkey sort; Randomized Exchange Sort; Bogo sort; Bogosorting; Blort sort; Pogosort; Shotgun sort; Quantum Bogosort; Quantum bogosort; Goro sort; Gorosort; Bogobogosort; Bozosort; Worstsort
  • Experimental runtime of bogosort

bogo-sort         
<algorithm, humour> /boh"goh-sort"/ (Or "stupid-sort") The archetypical perversely awful algorithm (as opposed to bubble sort, which is merely the generic *bad* algorithm). Bogo-sort is equivalent to repeatedly throwing a deck of cards in the air, picking them up at random, and then testing whether they are in order. It serves as a sort of canonical example of awfulness. Looking at a program and seeing a dumb algorithm, one might say "Oh, I see, this program uses bogo-sort." Also known as "monkey sort" after the {Infinite Monkey Theorem}. Compare brute force, Lasherism. bogo-sortadam/psort">An implementation (http://stdout.org/bogo-sortadam/psort). [Jargon File] (2002-04-07)
monkey sort         
Sort (C++)         
A FUNCTION FOR SORTING IN C++ STANDARD LIBRARY
Std::sort
sort is a generic function in the C++ Standard Library for doing comparison sorting. The function originated in the Standard Template Library (STL).

ويكيبيديا

Bogosort

In computer science, bogosort (also known as permutation sort, stupid sort, slowsort or bozosort) is a sorting algorithm based on the generate and test paradigm. The function successively generates permutations of its input until it finds one that is sorted. It is not considered useful for sorting, but may be used for educational purposes, to contrast it with more efficient algorithms.

Two versions of this algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input. An analogy for the working of the latter version is to sort a deck of cards by throwing the deck into the air, picking the cards up at random, and repeating the process until the deck is sorted. Its name is a portmanteau of the words bogus and sort.